Magic Properties of Special Class of Trees

In this paper, we consider special class of trees called uniform k-distant trees, which have many interesting properties. We show that they have an edge-magic total labeling, a super edge-magic total labeling, a (a, d)-edge-antimagic vertex labeling, an (a, d)-edgeantimagic total labeling, a super (a, d)edge-antimagic total labeling. Also we introduce a new labeling called edge bi-magic vertex labeling and prove that every uniform k-distant tree has edge bi-magic vertex labeling.